A Self-Learning Evolutionary Chess Program
نویسندگان
چکیده
A central challenge of artificial intelligence is to create machines that can learn from their own experience and perform at the level of human experts. Using an evolutionary algorithm, a computer program has learned to play chess by playing games against itself. The program learned to evaluate chessboard configurations by using the positions of pieces, material and positional values, and neural networks to assess specific sections of the chessboard. During evolution, the program improved its play by almost 400 rating points. Testing under simulated tournament conditions against Pocket Fritz 2.0 indicated that the evolved program performs above the master level.
منابع مشابه
Evaluating a Parallel Evolutionary Algorithm on the Chess Endgame Problem
Classifying the endgame positions in Chess can be challenging for humans and is known to be a difficult task in machine learning. An evolutionary algorithm would seem to be the ideal choice. We describe our implementation of a parallel island model and evaluate it in the context of the Chess Endgame data set from the UCI machine learning repository. We are mainly interested in impact of paralle...
متن کاملAn Evolutionary Approach for the Tuning of a Chess Evaluation Function Using Population Dynamics
Using the game of chess, this paper proposes an approach for the tuning of evaluation function parameters based on evolutionary algorithms. We introduce an iterative method for population member selection and show how the resulting win, loss, or draw information from competition can be used in conjunction with the statistical analysis of the population to develop evaluation function parameter v...
متن کاملFurther Evolution of a Self-Learning Chess Program
Previous research on the use of coevolution to improve a baseline chess program demonstrated a performance rating of 2550 against Pocket Fritz 2.0 (PF2). A series of 12 games (6 white, 6 black) was played against PF2 using the best chess program that resulted from 50 generations of variation and selection in self-play. The results yielded 9 wins, 2 losses, and 1 draw for the evolved program. Th...
متن کاملLearning to Play Board Games using Temporal Difference Methods
A promising approach to learn to play board games is to use reinforcement learning algorithms that can learn a game position evaluation function. In this paper we examine and compare three different methods for generating training games: (1) Learning by self-play, (2) Learning by playing against an expert program, and (3) Learning from viewing experts play against themselves. Although the third...
متن کاملBayesChess: A computer chess program based on Bayesian networks
In this paper we introduce a chess program able to adapt its game strategy to its opponent, as well as to adapt the evaluation function that guides the search process according to its playing experience. The adaptive and learning abilities have been implemented through Bayesian networks. We show how the program learns through an experiment consisting on a series of games that point out that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004